Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
نویسندگان
چکیده
منابع مشابه
Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
In this paper we construct two approximation hierarchies for the completely positive cone based on symmetric tensors. We show that one hierarchy corresponds to dual cones of a known polyhedral approximation hierarchy for the copositive cone, and the other hierarchy corresponds to dual cones of a known semidefinite approximation hierarchy for the copositive cone. As an application, we consider a...
متن کاملInterior points of the completely positive cone
A matrix A is called completely positive if it can be decomposed as A = BBT with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone which plays a role in certain optimization problems. A characterization of the interior of this cone is provided.
متن کاملStochastic Dilation of Symmetric Completely Positive Semigroups
This is a continuation of the study of the theory of quantum stochastic dilation of completely positive semigroups on a von Neumann or C∗ algebra, here with unbounded generators. The additional assumption of symmetry with respect to a semifinite trace allows the use of the Hilbert space techniques, while the covariance gives rise to better handle on domains. An Evans-Hudson flow is obtained, di...
متن کاملSymmetric curvature tensor
Recently, we have used the symmetric bracket of vector fields, and developed the notion of the symmetric derivation. Using this machinery, we have defined the concept of symmetric curvature. This concept is natural and is related to the notions divergence and Laplacian of vector fields. This concept is also related to the derivations on the algebra of symmetric forms which has been discu...
متن کاملExtension of Completely Positive Cone Relaxation to Polynomial Optimization
We propose the moment cone relaxation for a class of polynomial optimization problems (POPs) to extend the results on the completely positive cone programming relaxation for the quadratic optimization (QOP) model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the POPs, so that efficient numerical methods can be developed in the future. We es...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2013
ISSN: 1052-6234,1095-7189
DOI: 10.1137/100813816